Model theory for the higher order predicate calculus

A Higher-Order Calculus and Theory Abstraction

We present a higher-order calculus ECC which naturally combines Coquand-Huet's calculus of constructions and Martin-LL of's type theory with universes. ECC is very expressive, both for structured abstract reasoning and for program speciication and construction. In particular , the strong sum types together with the type universes provide a useful module mechanism for abstract description of mat...

A Domain-Theoretic Model for a Higher-Order Process Calculus

In this paper we study a higher-order process calculus, a restriction of one due to Boudol, and develop an abstract, model for it. By abstract we mean that the model is constructed domain-theoretically and reeects a certain conceptual viewpoint about observability. It is not constructed from the syntax of the calculus or from computation sequences. We describe a new powerdomain construction tha...

Higher-Order Lazy Narrowing Calculus: A Computation Model for a Higher-Order Functional Logic Language

Experiences with functional programming revealed that higher-order concept leads to powerful and succinct programming. Functional logic programming, an approach to integrate functional and logic programming, would naturally be expected to incorporate the notion of higher-order-ness. Little has been investigated how to incorporate higher-order-ness in functional logic programming. In this paper ...

The Marvel Programming Model: a higher-order distributed process calculus

On Bisimulation Theory in Linear Higher-Order π-Calculus

Higher-order process calculi have been receiving much attention in recent years for its significance in both theorey and practice. Work on bisimulations has never ceased evolving, typically represented by Thomsen and Sangiorgi for their work on bisimulation theory and encoding to and from first-order process calculi. Fu puts forth linear higher-order π-calculus, and makes improvement to previou...